On the Maximum Estrada Index of 3-Uniform Linear Hypertrees
نویسندگان
چکیده
For a simple hypergraph H on n vertices, its Estrada index is defined as [Formula in text], where λ 1, λ 2,…, λ n are the eigenvalues of its adjacency matrix. In this paper, we determine the unique 3-uniform linear hypertree with the maximum Estrada index.
منابع مشابه
Mathematical Problems for Complex Systems
As most of practical systems have high complexity, complex systems have become a rapidly growing area of mathematics and attracted many researchers. The study of complex systems not only has an important theoretical interest but also is motivated by problems from applied mathematics including physics, chemistry, astronomy, technology, and natural and social sciences. It should be noted that som...
متن کاملAlbertson energy and Albertson Estrada index of graphs
Let $G$ be a graph of order $n$ with vertices labeled as $v_1, v_2,dots , v_n$. Let $d_i$ be the degree of the vertex $v_i$ for $i = 1, 2, cdots , n$. The Albertson matrix of $G$ is the square matrix of order $n$ whose $(i, j)$-entry is equal to $|d_i - d_j|$ if $v_i $ is adjacent to $v_j$ and zero, otherwise. The main purposes of this paper is to introduce the Albertson ...
متن کاملThe Signless Laplacian Estrada Index of Unicyclic Graphs
For a simple graph $G$, the signless Laplacian Estrada index is defined as $SLEE(G)=sum^{n}_{i=1}e^{q^{}_i}$, where $q^{}_1, q^{}_2, dots, q^{}_n$ are the eigenvalues of the signless Laplacian matrix of $G$. In this paper, we first characterize the unicyclic graphs with the first two largest and smallest $SLEE$'s and then determine the unique unicyclic graph with maximum $SLEE$ a...
متن کاملA note on Prüfer-like coding and counting forests of uniform hypertrees
The present note is designing encoding and decoding algorithms for a forest of rooted uniform hypertrees and hypercycles in linear time, by using as little as n− 2 integers in the range [1, n]. This simple extension of the classical Prüfer code for rooted trees to an encoding for forests of rooted uniform hypertrees and hypercycles makes it possible to count them up, according to their number o...
متن کاملMaximum number of colors in hypertrees of bounded degree
The upper chromatic number χ(H) of a hypergraph H = (X, E) is the maximum number of colors that can occur in a vertex coloring φ : X → N such that no edge E ∈ E is completely multicolored. A hypertree (also called arboreal hypergraph) is a hypergraph whose edges induce subtrees on a fixed tree graph. It has been shown that on hypertrees it is algorithmically hard not only to determine exactly b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
دوره 2014 شماره
صفحات -
تاریخ انتشار 2014